IJCAI - 99 1 Temporal Planning with Mutual Exclusion Reasoning
نویسندگان
چکیده
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a compact planning graph representation that handles actions of di ering duration. The key to tgp performance is tight mutual exclusion reasoning which is based on an expressive language for bounding mutexes and includes mutexes between actions and propositions. Our experiments demonstrate that mutual exclusion reasoning remains valuable in a rich temporal setting.
منابع مشابه
Temporal Planning with Mutual Exclusion Reasoning
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...
متن کاملLong-Distance Mutual Exclusion for Propositional Planning
The use of mutual exclusion (mutex) has led to significant advances in propositional planning. However, previous mutex can only detect pairs of actions or facts that cannot be arranged at the same time step. In this paper, we introduce a new class of constraints that significantly generalizes mutex and can be efficiently computed. The proposed long-distance mutual exclusion (londex) can capture...
متن کاملTemporal Reasoning Involving Counterfactuals and Disjunctions
This paper describes a mechanism for nonmonotonic temporal reasoning involving counterfactuals and disjunctions. The mechanism supports a method for exploring alternatives well suited to automatic planning. The application of these techniques to robot problem solving is discussed with an emphasis on reasoning about exclusive choices and monitoring the continued warrant and effectiveness of prev...
متن کاملIntegrating Planning and Temporal Reasoning for Domains with Durations and Time Windows
The treatment of exogenous events in planning is practically important in many domains. In this paper we focus on planning with exogenous events that happen at known times, and affect the plan actions by imposing that the execution of certain plan actions must be during some time windows. When actions have durations, handling such constraints adds an extra difficulty to planning, which we addre...
متن کاملTemporal Defeasible Argumentation in Multi-Agent Planning
In this paper, I present my ongoing research on temporal defeasible argumentation-based multi-agent planning. In multi-agent planning a team of agents share a set of goals but have diverse abilities and temporal beliefs, which vary over time. In order to plan for these goals, agents start a stepwise dialogue consisting of exchanges of temporal plan proposals, plus temporal arguments against the...
متن کامل